On the vertices belonging to all, some, none minimum dominating set
نویسندگان
چکیده
We characterize the vertices belonging to all minimum dominating sets, some sets but not all, and no set. refine this characterization for well studied sub-classes of graphs: chordal, claw-free, triangle-free. Also we exhibit graphs answering open questions literature on sets.
منابع مشابه
Vertices belonging to all or to no minimum double dominating sets in trees
In a graph G = (V, E) , a vertex dominates itself and all its neighbors. A double dominating set of G is a dominating set that dominates every vertex of G at least twice. In this paper, we characterize vertices that are in all or in no minimum double dominating sets in trees.
متن کاملVertices Belonging to All or to No Minimum Locating Dominating Sets of Trees
A set D of vertices in a graph G is a locating-dominating set if for every two vertices u, v of G \ D the sets N(u) ∩ D and N(v) ∩ D are non-empty and different. In this paper, we characterize vertices that are in all or in no minimum locating dominating sets in trees. The characterization guarantees that the γL-excellent tree can be recognized in a polynomial time.
متن کاملVertices in all minimum paired-dominating sets of block graphs
Let G = (V,E) be a simple graph without isolated vertices. A set S ⊆ V is a paired-dominating set if every vertex in V − S has at least one neighbor in S and the subgraph induced by S contains a perfect matching. In this paper, we present a linear-time algorithm to determine whether a given vertex in a block graph is contained in all its minimum paired-dominating sets.
متن کاملVertices Contained in all or in no Minimum Paired-Dominating Set of a Tree
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. We characterize the set of vertices of a tree that are contained in all, or in no, minimum paired-dominating sets of the tree.
متن کاملVertices contained in all or in no minimum total dominating set of a tree
Let G be a graph with no isolated vertex. In this paper, we study a parameter that is squeezed between arguably the two most important domination parameters; namely, the domination number, γ(G), and the total domination number, γt(G). A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2020.08.020